Influence in Terrorist Networks: From Undirected to Directed Graphs
نویسندگان
چکیده
A methodology for converting terrorist networks from undirected graphs to simplified directed graphs (or digraphs), and mapping the flow of influence in them, is described. It is based on an “influence assumption”—that important personswithmore links influence less important persons with fewer links. This methodology, which was previously used to analyze the structure of influence relationships in Communist-bloc countries and the international system, is illustrated by its application to two terrorist networks constructed after 9/11. In the second more complex network, the hierarchy sheds light on the leadership and likely terrorist cells embedded in the network.Refined data and alternative assumptions about influence could provide additional insights into the structure of terrorist networks.
منابع مشابه
Project Summary Approximating Network Design Problems on Directed and Undirected Graphs
Network design on directed graphs are problems that require to select a minimum cost directed subgraph of a given edge-weighted directed graph, under some constraints. One of the main goals of this proposal is to understand some of the most fundamental network design problems on directed graphs whose exact approximability status remains unclear for a very long time. Directed graphs appear frequ...
متن کاملThe Configuration Model for Partially Directed Graphs
The configuration model was originally defined for undirected networks and has recently been extended to directed networks. Many empirical networks are however neither undirected nor completely directed, but instead usually partially directed meaning that certain edges are directed and others are undirected. In the paper we define a configuration model for such networks where nodes have in-, ou...
متن کاملApproximating survivable networks with β-metric costs
The Survivable Network Design (SND) problem seeks a minimum-cost subgraph that satisfies prescribed node-connectivity requirements. We consider SND on both directed and undirected complete graphs with -metric costs when c(xz) ≤ [c(xy) + c(yz)] for all x, y, z ∈ V , which varies from uniform costs ( = 1/2) to metric costs ( = 1). For the k-Connected Subgraph (k-CS) problem our ratios are: 1 + 2 ...
متن کاملA recovery algorithm for chain graphs
The class of chain graphs (CGs) involving both undirected graphs (=Markov networks) and directed acyclic graphs (= Bayesian networks) was introduced in middle eighties for description of probabilistic conditional independence structures. Every class of Markov equivalent CGs (that is, CGs describing the same conditional independence structure) has a natural representative, which is called the la...
متن کاملA conditional independence algorithm for learning undirected graphical models
When it comes to learning graphical models from data, approaches based on conditional independence tests are among the most popular methods. Since Bayesian networks dominate research in this field, these methods usually refer to directed graphs, and thus have to determine not only the set of edges, but also their direction. At least for a certain kind of possibilistic graphical models, however,...
متن کامل